On recovery of sparse signals via l1 minimization

نویسندگان

  • T. Tony Cai
  • Guangwu Xu
  • Jun Zhang
چکیده

This article considers constrained l1 minimization methods for the recovery of high dimensional sparse signals in three settings: noiseless, bounded error and Gaussian noise. A unified and elementary treatment is given in these noise settings for two l1 minimization methods: the Dantzig selector and l1 minimization with an l2 constraint. The results of this paper improve the existing results in the literature by weakening the conditions and tightening the error bounds. The improvement on the conditions shows that signals with larger support can be recovered accurately. This paper also establishes connections between restricted isometry property and the mutual incoherence property. Some results of Candes, Romberg and Tao (2006) and Donoho, Elad, and Temlyakov (2006) are extended.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recovery of signals by a weighted $\ell_2/\ell_1$ minimization under arbitrary prior support information

In this paper, we introduce a weighted l2/l1 minimization to recover block sparse signals with arbitrary prior support information. When partial prior support information is available, a sufficient condition based on the high order block RIP is derived to guarantee stable and robust recovery of block sparse signals via the weighted l2/l1 minimization. We then show if the accuracy of arbitrary p...

متن کامل

Numerical Studies of the Generalized l1 Greedy Algorithm for Sparse Signals

The generalized l1 greedy algorithm was recently introduced and used to reconstruct medical images in computerized tomography in the compressed sensing framework via total variation minimization. Experimental results showed that this algorithm is superior to the reweighted l1-minimization and l1 greedy algorithms in reconstructing these medical images. In this paper the effectiveness of the gen...

متن کامل

On recovery of block-sparse signals via mixed l2/lq (0 < q ¿ 1) norm minimization

Compressed sensing (CS) states that a sparse signal can exactly be recovered from very few linear measurements. While in many applications, real-world signals also exhibit additional structures aside from standard sparsity. The typical example is the so-called block-sparse signals whose non-zero coefficients occur in a few blocks. In this article, we investigate the mixed l2/lq(0 < q ≤ 1) norm ...

متن کامل

Recovery of High-Dimensional Sparse Signals via l1-Minimization

We consider the recovery of high-dimensional sparse signals via l 1 -minimization under mutual incoherence condition, which is shown to be sufficient for sparse signals recovery in the noiseless and noise cases. We study both l 1 -minimization under the l 2 constraint and the Dantzig selector. Using the two l 1 -minimization methods and a technical inequality, some results are obtained. They im...

متن کامل

Exact Recovery for Sparse Signal via Weighted l_1 Minimization

Numerical experiments in literature on compressed sensing have indicated that the reweighted l1 minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for sparse signal via weighted l1 minimization from the insight of the classical NSP (null space property) and RIC (restricted isometry constant) bound. We first int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2009